On the Edge Resolvability of Double Generalized Petersen Graphs
نویسندگان
چکیده
For a connected graph G = V , E , let id="M2"> v ∈ be vertex and id="M3"> e uw an edge. The distance between the id="M4"> edge id="M5"> is given by id="M6"> d min open="{" close="}" u w . A id="M7"> distinguishes two edges id="M8"> 1 2 if id="M9"> ≠ . well-known invariant related to resolvability of edges, namely, resolving set, studied for family id="M10"> 3 -regular graphs. set id="M11"> S vertices in id="M12"> metric generator id="M13"> every id="M14"> are distinguished some id="M15"> smallest cardinality id="M16"> called dimension denoted id="M17"> β As main result, we investigate minimum number which works as double generalized Petersen graphs, id="M18"> DGP n We have proved that id="M19"> , 4 when id="M20"> ≡ 0,1,3 mod id="M21"> id="M22">
منابع مشابه
Double Total Domination on Generalized Petersen Graphs
A set S of vertices in a graph G is a double total dominating set, abbreviated DTDS, of G if every vertex of G is adjacent to least two vertices in S. The minimum cardinality of a DTDS of G is the double total domination number of G. In this paper, we study the DTDS of the generalized Petersen graphs. Mathematics Subject Classification: 05C35
متن کاملGraceful labelings of the generalized Petersen graphs
A graceful labeling of a graph $G=(V,E)$ with $m$ edges is aninjection $f: V(G) rightarrow {0,1,ldots,m}$ such that the resulting edge labelsobtained by $|f(u)-f(v)|$ on every edge $uv$ are pairwise distinct. For natural numbers $n$ and $k$, where $n > 2k$, a generalized Petersengraph $P(n, k)$ is the graph whose vertex set is ${u_1, u_2, cdots, u_n} cup {v_1, v_2, cdots, v_n}$ and its edge set...
متن کاملOptimal Generalized Petersen Graphs
In this paper we establish a theorem on the maximum number of vertices of a generalized Petersen graph as a function of the diameter.
متن کاملGeneralizing the generalized Petersen graphs
The generalized Petersen graphs (GPGs) which have been invented by Watkins, may serve for perhaps the simplest nontrivial examples of “galactic” graphs, i.e. those with a nice property of having a semiregular automorphism. Some of them are also vertextransitive or even more highly symmetric, and some are Cayley graphs. In this paper, we study a further extension of the notion of GPGs with the e...
متن کاملOn Power Domination of Generalized Petersen Graphs
The power dominating problem is a variation of the classical domination problem in graphs. Electricity company use phase measurement units (PMUs) to produce the measuring data of a system, and use these data to estimate states of the system. Because of the high cost of PMUs, minimizing the number of PMUs on a system is an important problem for electricity companies. This problem can be modeled ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematics
سال: 2022
ISSN: ['2314-4785', '2314-4629']
DOI: https://doi.org/10.1155/2022/6490698